/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
bool p[maxn];
bool judge(ll n)
{
    if (n < 2)
        return false;
    for (ll i = 2; i * i <= n; i++)
    {
        if (n % i == 0)
            return false;
    }
    return true;
}

void init(ll n)
{
    for (ll i = 0; i <= n; i++)
    {
        p[i] = judge(i);
    }
    return;
}

int main()
{
    IOS;
    init(100000);
    ll n;
    cin >> n;
    ll num1, num2, num3;
    bool flag = true;
    for (ll i = 2; i * 3 <= n && flag; i++)
    {
        if (!p[i])
            continue;
        num1 = i;
        ll k = n - num1;
        for (ll j = i; j * 2 <= k && flag; j++)
        {
            if (!p[j])
                continue;
            num2 = j;
            num3 = k - num2;
            if (p[num3])
                flag = false;
        }
    }
    cout << num1 << " " << num2 << " " << num3 << endl;
    getchar();
    getchar();
    return 0;
}
